Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(X,g(X),Y) |
→ f(Y,Y,Y) |
| 2: |
|
g(b) |
→ c |
| 3: |
|
b |
→ c |
|
There is one dependency pair:
|
| 4: |
|
F(X,g(X),Y) |
→ F(Y,Y,Y) |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006